package Tree.Recursive;

import Utils.TreeNode;

/**
 * 二叉树的最大高度
 * Lettcode 104: https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/
 */
public class maxDepth {
    public int maxDepth(TreeNode root) {
        if (root == null) {
            return 0;
        }
        int left = maxDepth(root.left);
        int right = maxDepth(root.right);
        return Math.max(left, right) + 1;
    }
}
